Termination orders for 3-polygraphs
نویسنده
چکیده
Polygraphs are cellular presentations of higher-dimensional categories introduced in [Burroni 1993]. They have been proved to generalize term rewriting systems but they lack some tools widely used in the field. This note presents a result developped in [Guiraud 2004] which fills this gap for some 3dimensional polygraphs: it introduces a method to craft termination orders, one of the most useful ways to prove that computations specified by a formal system always end after a finite number of transformations.
منابع مشابه
Termination orders for 3-dimensional rewriting
This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each system are studied. Finally, a convergent 3-polygraph for the (commutative) theory of Z/2Z-vector spaces is given. In order to prove these results, it is ex...
متن کاملPrograms as polygraphs: computability and complexity
This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs. We prove that polygraphic programs form a Turing-complete computational model. Using already-known termination orders for polygraphs, we define simple programs as a special class of polygraphs equipped with a notion of polynomial in...
متن کاملPolygraphs for termination of left-linear term rewriting systems
We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic circuits. We translate the considered TRS into a polygraph of minimal size whose termination is proven with a polygraphic interpretation, then we get back the property on the TRS. We recall Yves Lafont’s general translation ...
متن کاملIntensional properties of polygraphs
We present polygraphic programs, a subclass of Albert Burroni’s polygraphs, as a computational model, showing how these objects can be seen as first-order functional programs. We prove that the model is Turing complete. We use polygraphic interpretations, a termination proof method introduced by the second author, to characterize polygraphic programs that compute in polynomial time. We conclude...
متن کاملOn "The Matching Polynomial of a Polygraph"
In this note we give an explanation for two phenomena mentioned in the concluding remarks of " The matching polynomial of a polygraph " by Babic et al. The following results are obtained: (1) Although three matrices for given polygraphs defined in the above article in general have different orders, they determine the same recurrence relations for the matching polynomial of these polygraphs. (2)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/math/0612084 شماره
صفحات -
تاریخ انتشار 2005